How much can lookahead help in online single machine scheduling
نویسندگان
چکیده
This paper studies online single machine scheduling where jobs have unit length and the objective is to maximize the number of completed jobs. Lookahead is considered to improve the competitiveness of online deterministic strategies. For preemption-restart model, we will prove a lower bound of ( LD + 2)/( LD + 1) for the case where LD 1 and 3/2 for the case where 0 LD < 1, in which LD is the length of time segment that online strategies can foresee at any time. For non-preemptive model, we mainly present a greedy strategy that has an optimal competitive ratio of 3/2 when 1 LD < 2 while its competitive ratio is bounded from above by 4/3 as LD goes larger. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملScheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job processing times are known in advance and preemption of jobs is allowed. Machines are non-continuously available, i.e., they can break down and recover at arbitrary time instances not known in advance. New machines may b...
متن کاملOnline Scheduling with Lookahead: Multipass Assembly Lines
This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...
متن کاملOnline lookahead on parameter learning algorithms for data acknowledgment and scheduling problems
متن کامل
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 106 شماره
صفحات -
تاریخ انتشار 2008